$$f$$ -Vectors Implying Vertex Decomposability
نویسندگان
چکیده
منابع مشابه
f-Vectors Implying Vertex Decomposability
We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d − 1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J. Herzog and T. Hibi. In fact, we prove a generalization of their theorem using combinatorial methods.
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملSequentially Cohen-macaulay Bipartite Graphs: Vertex Decomposability and Regularity
Let G be a bipartite graph with edge ideal I(G) whose quotient ring R/I(G) is sequentially Cohen-Macaulay. We prove: (1) the independence complex of G must be vertex decomposable, and (2) the Castelnuovo-Mumford regularity of R/I(G) can be determined from the invariants of G.
متن کاملcomplement of special chordal graphs and vertex decomposability
in this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially cohen-macaulay.
متن کاملf-VECTORS OF BARYCENTRIC SUBDIVISIONS
For a simplicial complex or more generally Boolean cell complex ∆ we study the behavior of the f and h-vector under barycentric subdivision. We show that if ∆ has a non-negative h-vector then the h-polynomial of its barycentric subdivision has only simple and real zeros. As a consequence this implies a strong version of the Charney-Davis conjecture for spheres that are the subdivision of a Bool...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2012
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-012-9477-6